a new algorithm for optimum open pit design: floating cone method iii

ultimate limits of an open pit, which define its size and shape at the end of the mine’s life, is the pit with the highest profit value. a number of algorithms such as floating or moving cone method, floating cone method ii and the corrected forms of this method, the korobov algorithm and the corrected form of this method, dynamic programming and the lerchs and grossmann algorithm based on graph theory have been developed to find out the optimum final pit limits. each of these methods has special advantages and disadvantages. among these methods, the floating cone method is the simplest and fastest technique to determine optimum ultimate pit limits to which variable slope angle can be easily applied. in contrast, this method fails to find out optimum final pit limits for all the cases. therefore, other techniques such as floating cone method ii and the corrected forms of this method have been developed to overcome this shortcoming. nevertheless, these methods are not always able to yield the true optimum pit. to overcome this problem, in this paper a new algorithm called floating cone method iii has been introduced to determine optimum ultimate pit limits. the results show that this method is able to produce good outcome.